Measure complexity and Möbius disjointness
نویسندگان
چکیده
منابع مشابه
Multiparty Communication Complexity of Disjointness
We obtain a lower bound of n on the k-party randomized communication complexity of the Disjointness function in the ‘Number on the Forehead’ model of multiparty communication when k is a constant. For k = o(log logn), the bounds remain super-polylogarithmic i.e. (logn). The previous best lower bound for three players until recently was Ω(logn). Our bound separates the communication complexity c...
متن کاملLattices, Möbius Functions and Communication Complexity
In a recent paper, Hajnal, Maass and Tura'n analyzed the communication complexity of graph connectivity. Building on this work, we develop a general framework for the study of a broad class of communication problems which has several interesting special cases including the graph connectivity problem. The approach is based on combinatorial lattice theory.
متن کاملWeak disjointness of measure preserving dynamical systems
Two measure preserving dynamical systems are weakly disjoint if some pointwise convergence property is satisfied by ergodic averages on their direct product (a precise definition is given below). Disjointness implies weak disjointness. We start studying this new concept, both by stating some general properties and by giving various examples. The content of the article is summarized in the intro...
متن کاملOn the Distributional Complexity of Disjointness
385 EIsevier Note Îï the distributional complexity of disjointness Abstract Razborov, À.À., Îï the distributional complexity of disjointness, Theoretical Computer ScienCe 106 (1992) 385-390. We prove that the distributional communication complexity of the predicate "disjointness" with respect to à very simple measure îï inputs is Ùï).
متن کاملThe Randomized Communication Complexity of Set Disjointness
We study the communication complexity of the disjointness function, in which each of two players holds a k-subset of a universe of size n and the goal is to determine whether the sets are disjoint. In the model of a common random string we prove that O(k) communication bits are sufficient, regardless of n. In the model of private random coins O(k + log logn) bits suffice. Both results are asymp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2019
ISSN: 0001-8708
DOI: 10.1016/j.aim.2019.03.007